Conditional independence in max-linear Bayesian networks
نویسندگان
چکیده
Motivated by extreme value theory, max-linear Bayesian networks have been recently introduced and studied as an alternative to linear structural equation models. However, for systems the classical independence results are far from exhausting valid conditional statements. We use tropical algebra derive a compact representation of distribution given partial observation, exploit this obtain complete description all relations. In context-specific case, where is queried relative specific conditioning variables, we introduce notion source DAG disclose context-free case characterize through modified separation concept, $\ast$-separation, combined with eigenvalue condition. also impact graph which describes how events spread deterministically network give characterization such graphs. Our analysis opens up several interesting questions concerning geometry.
منابع مشابه
Independence for Full Conditional Measures, Graphoids and Bayesian Networks
This paper examines definitions of independence for events and variables in the context of full conditional measures; that is, when conditional probability is a primitive notion and conditioning is allowed on null events. Several independence concepts are evaluated with respect to graphoid properties; we show that properties of weak union, contraction and intersection may fail when null events ...
متن کاملConditional independence in dynamic networks
Given a longitudinal network observed at time points t1 < · · · < tT , tie changes that happen in the interval (th, th+1) typically depend on the networks at t1, . . . , th. In this article we deal with the question whether changes within one interval mutually depend on each other or whether they are conditionally independent, given the previously observed networks. Answering this question for ...
متن کاملFast Conditional Independence-based Bayesian Classifier
Machine Learning (ML) has become very popular within Data Mining (KDD) and Artificial Intelligence (AI) research and their applications. In the ML and KDD contexts, two main approaches can be used for inducing a Bayesian Network (BN) from data, namely, Conditional Independence (CI) and the Heuristic Search (HS). When a BN is induced for classification purposes (Bayesian Classifier BC), it is po...
متن کاملValuation Networks and Conditional Independence
Valuation networks have been proposed as graph� ical representations of valuation�based systems (VBSs). The VBS framework is able to capture many uncertainty calculi including probability theory, Dempster�Shafer's belief�function theory, Spohn's epistemic belief theory, and Zadeh's possibility theory. In this paper, we show how valuation networks encode conditional indepen� dence relations. For...
متن کاملValuation Networks and Conditional Independence 191 Valuation Networks and Conditional Independence
Valuation networks have been proposed as graphical representations of valuation-based systems (VBSs). The VBS framework is able to capture many uncertainty calculi including probability theory, Dempster-Shafer’s belief-function theory, Spohn’s epistemic belief theory, and Zadeh’s possibility theory. In this paper, we show how valuation networks encode conditional independence relations. For the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Applied Probability
سال: 2022
ISSN: ['1050-5164', '2168-8737']
DOI: https://doi.org/10.1214/21-aap1670